An improved cut-and-solve algorithm for the single-source capacitated facility location problem
نویسندگان
چکیده
منابع مشابه
An improved cut-and-solve algorithm for the single-source capacitated facility location problem
In this paper we present an improved cut–and–solve algorithm for the single– source capacitated facility location problem. The algorithm consists of three phases. The first phase strengthens the integer program by a cutting plane algorithm to obtain a tight lower bound. The second phase uses a two level local branching heuristic to find an upper bound and, if optimality has not yet been establi...
متن کاملA Simulated Annealing Algorithm within the Variable Neighbourhood Search Framework to Solve the Capacitated Facility Location-Allocation Problem
In this study, we discuss the capacitated facility location-allocation problem with uncertain parameters in which the uncertainty is characterized by given finite numbers of scenarios. In this model, the objective function minimizes the total expected costs of transportation and opening facilities subject to the robustness constraint. To tackle the problem efficiently and effectively, an effici...
متن کاملAn exact method for the two-echelon, single-source, capacitated facility location problem
Facility location problems form an important class of integer programming problems, with applications in the telecommunication, distribution and transportation industries. In this paper we are concerned with a particular type of facility location problem in which there exist two echelons of facilities. Each facility in the second echelon has limited capacity and can be supplied by only one faci...
متن کاملImproved approximation of the general soft-capacitated facility location problem
The Soft-Capacitated Facility Location Problem, where each facility is composed of a variable number of fixed-capacity production units, has been recently studied in several papers, especially in the metric case. In this paper, we only consider the general problem where connection costs do not systematically satisfy the triangle inequality property. We show that an adaptation of the set coverin...
متن کاملApproximation algorithm for k-level hard capacitated facility location problem
In this paper, we consider k-level hard capacitated facility location problem.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: EURO Journal on Computational Optimization
سال: 2017
ISSN: 2192-4406,2192-4414
DOI: 10.1007/s13675-017-0084-4